Supporting Application-Specific Speculation with Competitive Parallel Execution

نویسندگان

  • Oliver Trachsel
  • Thomas R. Gross
چکیده

Parallel systems allow sequential programs that demand the highest possible performance or output quality to execute different versions of program parts in parallel to dynamically select the best version (i.e., the fastest or the one that produces the highest quality). The close coupling of multi-core systems offers new opportunities to explore such speculation. We discuss here how competitive parallel execution (CPE) supports such applicationspecific programmatic speculation. The key insight is that variations of the same program compete against each other during application-specific phases. These competing variants execute in complete isolation, thereby changing localized program state—comparable to a very coarse-grained transactional model. The state modifications of exactly one of these variants are committed and made globally visible based on an application-specific quality metric. The paper discusses operating system and architectural features to support and further extend the applicability and versatility of application-specific programmatic speculation. It also motivates the need for more research on how future systems can accommodate the diverse requirements of speculative approaches at different abstraction levels.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Understanding Method Level Speculation

Method level speculation (MLS) is an optimistic technique for parallelizing imperative programs, for which a variety of MLS systems and optimizations have been proposed. However, runtime performance strongly depends on the interaction between program structure and MLS system design choices, making it difficult to compare approaches or understand in a general way how programs behave under MLS. H...

متن کامل

Competitive Analysis of Dynamic Multiprocessor Allocation Strategies

The subject of this thesis is to study the problem of dynamic processor allocation in parallel application scheduling. Processor allocation involves determining the number of processors to allocate to each of several simultaneously executing parallel applications and possibly dynamically adjusting the allocations during execution to improve overall system performance. We devise and analytically...

متن کامل

Memory Dependence Speculation Tradeoffs in Centralized, Continuous-Window Superscalar Processors

We consider a variety of dynamic, hardware-based methods for exploiting load/store parallelism, including mechanisms that use memory dependence speculation. While previous work has also investigated such methods [19,4], this has been done primarily for split, distributed window processor models. We focus on centralized, continuous-window processor models (the common configuration today). We con...

متن کامل

The Superthreaded Processor Architecture

The common single-threaded execution model limits processors to exploiting only the relatively small amount of instruction-level parallelism available in application programs. The superthreaded processor, on the other hand, is a concurrent multithreaded architecture (CMA) that can exploit the multiple granularities of parallelism available in general-purpose application programs. Unlike other C...

متن کامل

Distributed Models of Thread Level Speculation

This paper introduces a novel application of thread-level speculation to a distributed heterogeneous environment. We propose and evaluate two speculative models which attempt to reduce some of the method call overhead associated with distributed objects. Thread-level speculation exploits parallelism in code which is not provable free of data dependencies. Our evaluation of applying thread-level...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010